On a projection-corrected component-by-component construction
نویسندگان
چکیده
منابع مشابه
Principal Component Projection Without Principal Component Analysis
We show how to efficiently project a vector onto the top principal components of a matrix, without explicitly computing these components. Specifically, we introduce an iterative algorithm that provably computes the projection using few calls to any black-box routine for ridge regression. By avoiding explicit principal component analysis (PCA), our algorithm is the first with no runtime dependen...
متن کاملComponent-by-component construction of good lattice rules
This paper provides a novel approach to the construction of good lattice rules for the integration of Korobov classes of periodic functions over the unit s-dimensional cube. Theorems are proved which justify the construction of good lattice rules one component at a time – that is, the lattice rule for dimension s+ 1 is obtained from the rule for dimension s by searching over all possible choice...
متن کاملFast component-by-component construction for (non-)primes ?
The component-by-component construction algorithm for rank-1 lattices can be formulated elegantly as a repeated matrix-vector product. As was shown in an earlier paper, this matrix-vector product can be done in time O(n log(n)) for n prime. Here we extend this result to general n using facts from algebra to obtain a construction cost of O(sn log(n)) for a rank-1 lattice in s dimensions with n p...
متن کاملComponent-By-Component Construction of Good Intermediate-Rank Lattice Rules
It is known that the generating vector of a rank-1 lattice rule can be constructed component-by-component to achieve strong tractability error bounds in both weighted Korobov spaces and weighted Sobolev spaces. Since the weights for these spaces are nonincreasing, the first few variables are in a sense more important than the rest. We thus propose to copy the points of a rank-1 lattice rule a n...
متن کاملRobust Principal Component Analysis by Projection Pursuit
Different algorithms for principal component analysis (PCA) based on the idea of projection pursuit are proposed. We show how the algorithms are constructed, and compare the new algorithms with standard algorithms. With the R implementation pcaPP we demonstrate the usefulness at real data examples. Finally, it will be outlined how the algorithms can be used for robustifying other multivariate m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2016
ISSN: 0885-064X
DOI: 10.1016/j.jco.2015.08.001